An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
نویسندگان
چکیده
This paper is concerned with a problem of maximizing the sum of several ratios of functions. We extend an algorithm, which has been designed to solve the sum-of-linear-ratios problem, for solving the sum-of-nonlinear-ratios problem. We also discuss the complexity of the problem and report the results of numerical experiments on the extended algorithm.
منابع مشابه
An Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملGlobal Optimization of Nonlinear Sums of Ratios
The nonlinear sum of ratios problem (P) has several important applications. However, it is also a difficult problem to solve, since it generally possesses many local optima that are not global optima. In this article we present and show the convergence of an algorithm for finding a global optimal solution to problem (P). The algorithm uses a branch and bound search procedure that globally solve...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملUsing finite difference method for solving linear two-point fuzzy boundary value problems based on extension principle
In this paper an efficient Algorithm based on Zadeh's extension principle has been investigated to approximate fuzzy solution of two-point fuzzy boundary value problems, with fuzzy boundary values. We use finite difference method in term of the upper bound and lower bound of $r$- level of fuzzy boundary values. The proposed approach gives a linear system with crisp tridiagonal coefficients matr...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Optimization Letters
دوره 6 شماره
صفحات -
تاریخ انتشار 2012